Natural Language Plurals in Logic Programming Queries
نویسنده
چکیده
This paper presents a representation for natural language plurals in knowledge base queries, implementing collective, distributive, cumulative, and multiply distributive senses of the plural by means of higher predicates. The underlying semantics is based on Franconi’s theory of collections. The collective reading of a plural applies the predicate to the whole collection; the distributive reading applies the predicate to all of the elements; and the cumulative reading says that each element either satisfies the predicate, or belongs to some collection that does so. Implicit in the cumulative reading is the notion of element– property, the property of belonging to some collection that satisfies a given predicate. Another reading of the plural, here termed the multiply distributive, requires a straightforward extension of the system to allow simultaneous distribution over more than one variable at once, with none of the distributions having scope over any other. Simultaneous distribution is implemented as a metalogical predicate that transforms queries before executing them.
منابع مشابه
Learning to Parse Natural Language Database Queries into Logical Form
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signiicantly more useful than a grammar or au-tomata that simply recognizes syntactically well-formed strings. This paper reviews our work on using inductive logic programming methods to learn de-terministic shift-reduce parsers that translate natural language into a semantic representatio...
متن کاملAppears in 1997 Workshop on Automata Induction , Grammatical Inference , and Language Acquisition
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signiicantly more useful than a grammar or au-tomata that simply recognizes syntactically well-formed strings. This paper reviews our work on using inductive logic programming methods to learn de-terministic shift-reduce parsers that translate natural language into a semantic representatio...
متن کاملTo appear in 1997 Workshop on Automata Induction , Grammatical Inference , and Language Acquisition
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signiicantly more useful than a grammar or au-tomata that simply recognizes syntactically well-formed strings. This paper reviews our work on using inductive logic programming methods to learn de-terministic shift-reduce parsers that translate natural language into a semantic representatio...
متن کاملAppears in Proceedings of the ICML - 97 Workshop on Automata Induction , Grammatical Inference , and Language Aquicision
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signi cantly more useful than a grammar or automata that simply recognizes syntactically wellformed strings. This paper reviews our work on using inductive logic programming methods to learn deterministic shift-reduce parsers that translate natural language into a semantic representation. ...
متن کاملAppears in Proceedings of the ICML - 97 Workshop on Automata Induction , Grammatical Inference , and Language
For most natural language processing tasks, a parser that maps sentences into a semantic representation is signi cantly more useful than a grammar or automata that simply recognizes syntactically wellformed strings. This paper reviews our work on using inductive logic programming methods to learn deterministic shift-reduce parsers that translate natural language into a semantic representation. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Artificial Intelligence
دوره 11 شماره
صفحات -
تاریخ انتشار 1997